Open irredundance and maximum degree in graphs
نویسندگان
چکیده
منابع مشابه
Irredundance, secure domination and maximum degree in trees
It is shown that the lower irredundance number and secure domination number of an n vertex tree T with maximum degree 3, are bounded below by 2(n+ 1)/(2 + 3) (T = K1, ) and ( n+ − 1)/(3 − 1), respectively. The bounds are sharp and extremal trees are exhibited. © 2006 Elsevier B.V. All rights reserved. MSC: 05C69
متن کاملTotal irredundance in graphs
A set S of vertices in a graph G is called a total irredundant set if, for each vertex v in G; v or one of its neighbors has no neighbor in S −{v}. We investigate the minimum and maximum cardinalities of maximal total irredundant sets. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملDistance Domination and Distance Irredundance in Graphs
A set D ⊆ V of vertices is said to be a (connected) distance k-dominating set of G if the distance between each vertex u ∈ V − D and D is at most k (and D induces a connected graph in G). The minimum cardinality of a (connected) distance k-dominating set in G is the (connected) distance k-domination number of G, denoted by γk(G) (γ c k (G), respectively). The set D is defined to be a total k-do...
متن کاملMaximum degree in graphs of diameter 2
The purpose of this paper is to prove that, with the exception of C 4 , there are no graphs of diameter 2 and maximum degree d with d 2 vertices . On one hand our paper is an extension of [4] where it was proved that there are at most four Moore graphs of diameter 2 (i .e . graphs of diameter 2, maximum degree d, and d2 + 1 vertices) . We also use the eigenvalue method developed in that paper ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.10.002